package org.pralu.siruri;

import java.util.Scanner;

public class FractiiCrescatoare {

	/*
	 * 7/55 se citesc a,b,b,d,e,f nr nat strict pozitive.Se cere sa se scrie un
	 * algoritm care verifica relatia. daca este adevarata se afiseaza ADEVARAT,
	 * altfel FALS. algoritmul nu va folosi impartirea. a/b<=e/f<+c/d
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a;
		int b;
		int c;
		int d;
		int e;
		int f;
		System.out.println("introduceti numerele a,b,c,d,e,f");
		a = in.nextInt();
		b = in.nextInt();
		c = in.nextInt();
		d = in.nextInt();
		e = in.nextInt();
		f = in.nextInt();

		int c1; // catul impartirii a/b
		int c2; // catul impartirii c/d
		int c3; // catul impartirii e/f
		c1 = 0;
		c2 = 0;
		c3 = 0;

		while (a - b >= 0) {
			c1 = c1 + 1;
			a = a - b;
		}
		while (e - f >= 0) {
			c2 = c2 + 1;
			e = e - f;
		}
		while (c - d >= 0) {
			c3 = c3 + 1;
			c = c - d;
		}
		System.out.println(" a : " + a + " e: " + e + " c: " + c + " c1 " + c1
				+ " c2 " + c2 + " c3 " + c3);

		if (((c1 + a) <= (c2 + e)) && ((c2 + e) <= (c3 + c))) {
			System.out.println("adevarat");
		} else {
			System.out.println("fals");
		}
	}

}
